On the Performance of Low Complexity Multiple Turbo Codes∗

نویسندگان

  • Ching He
  • Adrish Banerjee
  • Daniel J. Costello
  • Peter C. Massey
چکیده

In this paper, we study the convergence properties of low-complexity (2and 4-state) multiple turbo codes on an AWGN channel. An analytical approach to determine the extrinsic information transfer characteristics of 2-state codes is presented. This is then used to compute the convergence thresholds of several rate 1/2, 2-state multiple turbo codes. The convergence thresholds predicted by the analytical method match those based on transfer characteristics derived from Monte Carlo simulations. Both the analytical and simulation-based approaches are then used to search for rate 1/2, 2and 4-state multiple turbo codes with low convergence thresholds for different constituent encoders and puncturing patterns. Finally, BER simulations are presented verifying the convergence thresholds predicted by the analysis.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design of Three-Dimensional Multiple Slice Turbo Codes

This paper proposes a new approach to designing low-complexity high-speed turbo codes for very low frame error rate applications. The key idea is to adapt and optimize the technique of multiple turbo codes to obtain the required frame error rate combined with a family of turbo codes, called multiple slice turbo codes (MSTCs), which allows high throughput at low hardware complexity. The proposed...

متن کامل

Bit Interleaved Coded Modulation Using Multiple Turbo Codes

Bandwidth efficient coding schemes employing bit interleaved coded modulation and low complexity multiple turbo codes are investigated. The BER performance of these designs is shown to be superior to bit interleaved coded modulation schemes using conventional turbo codes.

متن کامل

Concatenated space-time block codes and TCM, turbo TCM, convolutional as well as turbo codes

Space-time block codes provide substantial diversity advantages for multiple transmit antenna systems at a low decoding complexity. In this paper, we concatenate space-time codes with Convolutional Codes (CC), Turbo Convolutional codes (TC), Turbo BCH codes (TBCH), Trellis Coded Modulation (TCM) and Turbo Trellis Coded Modulation (TTCM) schemes for achieving a high coding gain. The associated p...

متن کامل

Concatenated tree codes: A low-complexity, high-performance approach

This paper is concerned with a family of concatenated tree (CT) codes. CT codes are special low-density paritycheck (LDPC) codes consisting of several trees with large spans. They can also be regarded as special turbo codes with hybrid recursive/nonrecursive parts and multiple constituent codes. CT codes are decodable by the belief-propagation algorithm. They combine many advantages of LDPC and...

متن کامل

Search Based Weighted Multi-Bit Flipping Algorithm for High-Performance Low-Complexity Decoding of LDPC Codes

In this paper, two new hybrid algorithms are proposed for decoding Low Density Parity Check (LDPC) codes. Original version of the proposed algorithms named Search Based Weighted Multi Bit Flipping (SWMBF). The main idea of these algorithms is flipping variable multi bits in each iteration, change in which leads to the syndrome vector with least hamming weight. To achieve this, the proposed algo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002